Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((WANG Xinyi[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Loop-level speculative parallelism analysis of kernel program in TACLeBench
MENG Huiling, WANG Yaobin, LI Ling, YANG Yang, WANG Xinyi, LIU Zhiqin
Journal of Computer Applications 2021, 41 (
9
): 2652-2657. DOI:
10.11772/j.issn.1001-9081.2020111792
Abstract
(
258
)
PDF
(1190KB)(
219
)
Knowledge map
Save
Thread-Level Speculation (TLS) technology can tap the parallel execution potential of programs and improve the utilization of multi-core resources. However, the current TACLeBench kernel benchmarks are not effectively analyzed in TLS parallelization. In response to this problem, the loop-level speculative execution analysis scheme and analysis tool were designed. With 7 representative TACLeBench kernel benchmarks selected, firstly, the initialization analysis was performed to the programs, the program hot fragments were selected to insert the loop identifier. Then, the cross-compilation was performed to these fragments, the program speculative thread and the memory address related data were recorded, and the maximun potential of the loop-level parallelism was analyzed. Finally, the program runtime characteristics (thread granularity, parallelizable coverage, dependency characteristics) and the impacts of the source code on the speedup ratio were comprehensively discussed. Experimental results show that:1) this type of programs is suitable for TLS acceleration, compared with serial execution results, under the loop structure speculative execution, the speedup ratios for most programs are above 2, and the highest speedup ratio in them can reach 20.79; 2) by using TLS to accelerate the TACLeBench kernel programs, most applications can effectively make use of 4-core to 16-core computing resources.
Reference
|
Related Articles
|
Metrics
Select
Data sharing model of smart grid based on double consortium blockchains
ZHANG Lihua, WANG Xinyi, HU Fangzhou, HUANG Yang, BAI Jiayi
Journal of Computer Applications 2021, 41 (
4
): 963-969. DOI:
10.11772/j.issn.1001-9081.2020111721
Abstract
(
533
)
PDF
(1411KB)(
930
)
Knowledge map
Save
Considering the data sharing difficulties and the risk of privacy disclosure in grid cloud server based on blockchain, a Data Sharing model based on Double Consortium Blockchains in smart grid(DSDCB) was proposed. Firstly, the data of electricity was stored under-chain by Inter Planetary File System(IPFS), the IPFS file fingerprints were stored on-chain, and the electricity data was shared to other consortium blockchain based on the multi-signature notary technology. Secondly, with ensuring privacy from leakage, proxy re-encryption and secure multi-party computing were combined to share single-node or multi-node security data. Finally, fully homomorphic encryption algorithm was used to integrate ciphertext data reasonably without decrypting the electricity data. The 51% attack, sybil attack, replay attack and man-in-the-middle attacks were resisted by the single-node cross-chain data sharing model of DSDCB. It was verified that the security and privacy of data were guaranteed by the secure multi-party cross-chain data sharing model of DSDCB when the number of malicious participants was less than
k
and the number of honest participants was more than 1. The simulation comparison shows that the computational cost of the DSDCB model is lower than those of Proxy Broadcast Re-Encryption(PBRE) and Data Sharing scheme based on Conditional PBRE(CPBRE-DS), and the model is more feasible than the Fully Homomorphic Non-interactive Verifiable Secret Sharing(FHNVSS) scheme.
Reference
|
Related Articles
|
Metrics